Measuring shared knowledge with group false memory
نویسندگان
چکیده
منابع مشابه
Reducing False Sharing on Shared Memory Multiprocessors
We have developed compiler algorithms that analyze coarse-grained, explicitly parallel programs and restructure their shared data to minimize the number of false sharing misses. The algorithms analyze the per-process data accesses to shared data, use this information to pinpoint the data structures that are prone to false sharing and choose an appropriate transformation to reduce it. The algori...
متن کاملTowards Modeling False Memory With Computational Knowledge Bases
One challenge to creating realistic cognitive models of memory is the inability to account for the vast common-sense knowledge of human participants. Large computational knowledge bases such as WordNet and DBpedia may offer a solution to this problem but may pose other challenges. This paper explores some of these difficulties through a semantic network spreading activation model of the Deese-R...
متن کاملFalse Sharing and its E ect on Shared Memory Performance
False sharing occurs when processors in a shared-memory parallel system make references to di erent data objects within the same coherence block (cache line or page), thereby inducing \unnecessary" coherence operations. False sharing is widely believed to be a serious problem for parallel program performance, but a precise de nition and quanti cation of the problem has proven to be elusive. We ...
متن کاملA False-Sharing Free Distributed Shared Memory Management Scheme
Distributed shared memory (DSM) systems on top of network of workstations are especially vulnerable to the impact of false sharing because of their higher memory transaction overheads and thus higher false sharing penalties. In this paper we develop a dynamic-granularity shared memory management scheme that eliminates false sharing without sacrificing the transparency to conventional shared-mem...
متن کاملDynamically Controlling False Sharing in Distributed Shared Memory
Distributed shared memory (DSM) alleviates the need to program message passing explicitly on a distributed-memory machine. In order to reduce memory latency, a DSM replicates copies of data. This paper examines several current approaches to controlling thrashing caused by false sharing in a DSM. Then it introduces a novel memory consistency protocol, writer-owns , which detects and eliminates f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2018
ISSN: 2045-2322
DOI: 10.1038/s41598-018-28347-4